- node vector
- узловой вектор
Англо-русский словарь промышленной и научной лексики. 2014.
Англо-русский словарь промышленной и научной лексики. 2014.
Node graph architecture — is a type of software design which builds around modular node components which can be connected together to form a graph. Often the software s underlying node graph architecture is also exposed to the end user as a 2 dimensional visualization of… … Wikipedia
Ad hoc On-Demand Distance Vector Routing — Ad hoc On Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad hoc networks. It is jointly developed in Nokia Research Center of University of California, Santa Barbara and… … Wikipedia
The vector of a quaternion — In the 19th century, the vector of a quaternion written Vq was a well defined mathematical entity in the classical quaternion notation system. This article is written using classical nomenclature. In this article the word vector means the… … Wikipedia
Destination-Sequenced Distance Vector routing — (DSDV) is a table driven routing scheme for ad hoc mobile networks based on the Bellman Ford algorithm. It was developed by C. Perkins and P.Bhagwat in 1994. The main contribution of the algorithm was to solve the routing loop problem. Each entry … Wikipedia
Distance-vector routing protocol — In computer communication theory relating to packet switched networks, a distance vector routing protocol is one of the two major classes of routing protocols, the other major class being the link state protocol. Distance vector routing protocols … Wikipedia
Longitude of the ascending node — The longitude of the ascending node (☊ or Ω) is one of the orbital elements used to specify the orbit of an object in space. It is the angle from a reference direction, called the origin of longitude , to the direction of the ascending node,… … Wikipedia
Path vector protocol — A path vector protocol is a computer network routing protocol in which it maintains the path that update information takes as it diffuses through the network. Updates which have looped through the network and returned to the same node are easily… … Wikipedia
Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… … Wikipedia
Self-organizing map — A self organizing map (SOM) is a type of artificial neural network that is trained using unsupervised learning to produce a low dimensional (typically two dimensional), discretized representation of the input space of the training samples, called … Wikipedia
Enhanced Interior Gateway Routing Protocol — (EIGRP) is a Cisco proprietary routing protocol loosely based on their original IGRP. EIGRP is an advanced distance vector routing protocol, with optimizations to minimize both the routing instability incurred after topology changes, as well as… … Wikipedia
Breadth-first search — Infobox Algorithm class=Search Algorithm Order in which the nodes are expanded data=Graph time=O(|V|+|E|) = O(b^d) space=O(|V|+|E|) = O(b^d) optimal=yes (for unweighted graphs) complete=yesIn graph theory, breadth first search (BFS) is a graph… … Wikipedia